Monadic Second Order Logic with Measure and Category Quantifiers
نویسندگان
چکیده
We investigate the extension of Monadic Second Order logic, interpreted over infinite words and trees, with generalized “for almost all” quantifiers interpreted using the notions of Baire category and Lebesgue measure. All three authors were supported by the Polish National Science Centre grant no. 2014-13/B/ST6/03595. The work of the second author has also been supported by the project ANR-16-CE25-0011 REPAS.. LOGICAL METHODS IN COMPUTER SCIENCE DOI:10.2168/LMCS-??? c © H. Michalewski, M. Mio, and M. Skrzypczak Creative Commons
منابع مشابه
The hierarchy inside closed monadic Σ1 collapses on the infinite binary tree
Closed monadic Σ1, as proposed in [AFS98], is the existential monadic second order logic where alternation between existential second order quantifiers and first order quantifiers is allowed. Despite some effort very little is known about the expressive power of this logic on finite structures. We construct a tree automaton which exactly characterizes closed monadic Σ1 on the Rabin tree and giv...
متن کاملTowards Elimination of Second-Order Quantifiers in the Separated Fragment
It is a classical result that the monadic fragment of secondorder logic admits elimination of second-order quantifiers. Recently, the separated fragment (SF) of first-order logic has been introduced. SF generalizes the monadic first-order fragment without equality, while preserving decidability of the satisfiability problem. Therefore, it is a natural question to ask whether SF also admits elim...
متن کاملThe Downward Transfer of Elementary Satisfiability of Partition Logics
The following operation has frequently occurred in mathematics and its applications: partition a set into several disjoint non-empty subsets, so that the elements in each partition subset are homogeneous or indistinguishable with respect to some given properties. H.-D.Ebbinghaus first (in 1991) distilled from this phenomenon, which is a monadic second order property in nature, a special kind of...
متن کاملCharacterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملOn Second-Order Monadic Groupoidal Quantifiers
We study logics defined in terms of so-called second-order monadic groupoidal quantifiers. These are generalized quantifiers defined by groupoid word-problems or equivalently by context-free languages. We show that, over strings with built-in arithmetic, the extension of monadic second-order logic by all second-order monadic groupoidal quantifiers collapses to its fragment mon-QGrpFO. We also s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.04769 شماره
صفحات -
تاریخ انتشار 2017